Maximal stream and minimal cutset for first passage percolation through a domain of $\mathbb{R}^{d}$
نویسندگان
چکیده
منابع مشابه
Exponential concentration for First Passage Percolation through modified Poincare19 einequalities
Résumé: On obtient une nouvelle inégalité de concentration exponentielle pour la percolation de premier passage, valable pour une large classe de distributions des temps d’arêtes. Ceci améliore et étend un résultat de Benjamini, Kalai et Schramm [5] qui donnait une borne sur la variance pour des temps d’arêtes suivant une loi de Bernoulli. Notre approche se fonde sur des inégalités fonctionnell...
متن کاملMonotonicity in first-passage percolation
We consider standard first-passage percolation on Zd. Let e1 be the first coordinate vector. Let a(n) be the expected passage time from the origin to ne1. In this short paper, we note that a(n) is increasing under some strong condition on the support of the distribution of the passage times on the edges.
متن کاملGeodesics in First-Passage Percolation
We consider a wide class of ergodic first passage percolation processes on Z2 and prove that there exist at least four one-sided geodesics a.s. We also show that coexistence is possible with positive probability in a four color Richardson’s growth model. This improves earlier results of Häggström and Pemantle [9], Garet and Marchand [7] and Hoffman [11] who proved that first passage percolation...
متن کاملFirst passage percolation and a model for competing spatial growth
An interacting particle system modelling competing growth on the Z2 lattice is defined as follows. Each x ∈ Z2 is in one of the states {0, 1, 2}. 1’s and 2’s remain in their states forever, while a 0 flips to a 1 (resp. a 2) at a rate equal to the number of its neighbours which are in state 1 (resp. 2). This is a generalization of the well known Richardson model. 1’s and 2’s may be thought of a...
متن کاملBatch queues, reversibility and first-passage percolation
We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have geometric distributions has also been previously studied. We describe a common extension to a more general class where the batches are the product of a Bernoulli and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2014
ISSN: 0091-1798
DOI: 10.1214/13-aop851